The Multi-Depot Cumulative Vehicle Routing Problem With Mandatory Visit Times and Minimum Delayed Latency

This paper introduces a novel variant of the cumulative vehicle routing problem (CCVRP) that deals with home health care (HHC) logistics. It includes multiple nonfixed depots and emergency trips from patients to closest depot. The aim is minimize system's delayed latency by satisfying mandatory visit times. Delayed corresponds caregivers' total overtime hours worked while visiting patients. A new mixed-integer linear programming model proposed address this problem. Computational experiments, more than 165 benchmark instances, are carried out using CPLEX Gurobi MIP solvers. results indicate patients' geographical distribution directly impacts complexity An analysis parameters proves instances depots/vehicles or longer workdays significantly easier solve original cases. show outperforms in 55% analyzed, performs better only 16% them. To best our knowledge, first VRP minimizes HHC study use objective function.